$\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability Problem
نویسندگان
چکیده
The directed graph reachability problem takes as input an n-vertex directed graph G = (V,E), and two distinguished vertices s and t. The problem is to determine whether there exists a path from s to t in G. This is a canonical complete problem for class NL. Asano et al. proposed an Õ( √ n) space and polynomial time algorithm for the directed grid and planar graph reachability problem. The main result of this paper is to show that the directed graph reachability problem restricted to grid graphs can be solved in polynomial time using only Õ(n) space.
منابع مشابه
n)-Space and Polymomial-time Algorithm for the Planar Directed Graph Reachability Problem
Throughout this paper we will use n to denote the number of vertices of an input graph, which is the unique input size parameter. For a directed graph G = (V,E), its underlying graph is the undirected graph ‘G = (V, ‘E), where the vertex pair {u, v} belongs to ‘E if and only if at least one of (u, v) or (v, u) belongs to E. The planar directed graph reachability problem is a special case of the...
متن کاملAn Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as points-to-analysis. Solving the CFL reachability problem in the general case is very hard. Popular solutions resorting to a graph traversal exhibit a time complexity of O(kn) for a grammar of size k. For Dyck CFLs, a parti...
متن کاملAn O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Given a graph G and two vertices s and t in it, graph reachability is the problem of checking whether there exists a path from s to t in G. We show that reachability in directed layered planar graphs can be decided in polynomial time and O(n ) space, for any > 0. The previous best known space bound for this problem with polynomial time was approximately O( √ n) space [INP13]. Deciding graph rea...
متن کاملAn E � cient Algorithm for Solving the Dyck - CFL Reachability Problem on Trees ?
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as points-to-analysis. Solving the CFL reachability problem in the general case is very hard. Popular solutions resorting to a graph traversal exhibit a time complexity of O(kn) for a grammar of size k. For Dyck CFLs, a parti...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کامل